A Fault Tolerant Carry Select Adder with Modular Self Checking Scheme
نویسندگان
چکیده
This paper presents Fault Tolerant Carry Select Adder (FT-CSA), most widely used type of adder, based on the self checking scheme with modular architecture. The error recovery capability is derived using generic input/output combination of carry select adder with predetermined fault and error set. The experimental results show that proposed FT-CSA has nearly 50% overhead compared with the typical CSA without fault-tolerant scheme but achieves the significant improvement compared with typical redundancy scheme.
منابع مشابه
Self-repairing adder using fault localization
Keywords: Self-checking adder Carry-select adder Fault localization Self-repairing adder Multiple faults a b s t r a c t In this paper we propose an area-efficient self-repairing adder that can repair multiple faults and identify the particular faulty full adder. Fault detection and recovery has been carried out using self-checking full adders that can diagnose the fault based on internal funct...
متن کاملA Pragmatic Approach to On-Line Testing
Modeling and simulation of time domain faults in digital systems p. 5 Sizing CMOS circuits for increased transient error tolerance p. 11 Low-area on-chip circuit for jitter measurement in a phase-locked loop p. 17 Necessary and sufficient conditions for the existence of totally self-checking circuits p. 25 Self-checking code-disjoint carry-select adder with low area overhead by use of add1-circ...
متن کاملCarry checking/parity prediction adders and ALUs
In this paper, we present efficient self-checking implementations valid for all existing adder and arithmatic and logic unit (ALU) schemes (e.g., ripple carry, carry lookahead, skip carry schemes). Among all the known self-checking adder and ALU designs, the parity prediction scheme has the advantage that it requires the minimum hardware overhead for the adder/ALU and the minimum hardware overh...
متن کاملDesign and Characterization of Fault Tolerant Power Parallel Prefix Adders using FPGA Design
Parallel-prefix adders (also known as carry tree adders) are known to have the best performance in VLSI designs. However, this performance advantage does not translate directly into FPGA implementations due to constraints on logic block configurations and routing overhead. This paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and...
متن کاملFault-tolerant, Real-time Reconfigurable Prefix Adder
In this paper, we assimilate and integrate two recent developments in prefix adder design and theory to create a fault-tolerant, real-time reconfigurable prefix adder. By exploiting the inherent redundancy of a Kogge-Stone adder we are able to extract signals to detect and correct from a single-fault. Our 16-bit design consumes less than 44% the hardware overhead of a comparable triple modular ...
متن کامل